Towards a descriptive set theory for domain-like structures

Towards a descriptive set theory for domain-like structures

This is a survey of results in descriptive set theory for domains and similar spaces, with the emphasis on the ω-algebraic domains. We try to demonstrate that the subject is interesting in its own right and is closely related to some areas of theoretical computer science. Since the subject is still in its beginning, we discuss in detail several open questions and possible future development. We...

Descriptive Set Theory Descriptive Set Theory

Descriptive Set Theory Problem Set

Prove that any strictly monotone sequence (Uα)α<γ of open subsets of X has countable length, i.e. γ is countable. Hint: Use the same idea as in the proof of (a). (c) Show that every monotone sequence (Uα)α<ω1 open subsets of X eventually stabilizes, i.e. there is γ < ω1 such that for all α < ω1 with α ≥ γ, we have Uα = Uγ. Hint: Use the regularity of ω1. (d) Conclude that parts (a), (b) and (c)...

Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory. Presently, we mainly focus on developing the ideas in the category of represented spaces.

Some descriptive set theory

Definition 1.1. Let (X, τ) be a topological space. A subset D ⊆ X is called dense if D ∩O 6= ∅ for every nonempty open set O ⊆ X. X is called separable if X has a countable dense subset. X is called metrizable if there is a metric d on X such that the topology τ is the same as the topology induced by the metric. The metric is called complete if every Cauchy sequence converges in X. Finally, X i...